Multiplicity of global minima for parametrized functions
نویسندگان
چکیده
منابع مشابه
Using Global Line Searches for Nding Global Minima of Mlp Error Functions
In this paper we consider a possible improvment of conjugate gradient methods commonly used for training multilayer perceptrons. These methods rely on a line search procedure which is partially responsible for the fact that only local minima are found. We propose to perform line searches along very long lines in order to nd global minima; as usual line search procedures are not suitable in this...
متن کاملGlobal minima for semilinear optimal control problems
We consider an optimal control problem subject to a semilinear elliptic PDE together with its variational discretization. We provide a condition which allows to decide whether a solution of the necessary first order conditions is a global minimum. This condition can be explicitly evaluated at the discrete level. Furthermore, we prove that if the above condition holds uniformly with respect to t...
متن کاملVerifying global minima for L2 minimization problems
We consider the least-squares (L2) triangulation problem and structure-and-motion with known rotatation, or known plane. Although optimal algorithms have been given for these algorithms under an L-infinity cost function, finding optimal least-squares (L2) solutions to these problems is difficult, since the cost functions are not convex, and in the worst case can have multiple minima. Iterative ...
متن کاملTuning Vector Parametrized Reinforcement Functions
Juan M. Santos [email protected] Andreas Matt [email protected] Claude F. Touzet [email protected] Depto.de Computación, FCEN; University of Buenos Aires; Cdad.Universitaria, Pab.I; Buenos Aires, Argentina Institute of Mathematics, University of Innsbruk, Viktor-Franz-Hess Haus, Technikerstr.25/7, A-6020 Innsbruck, Austria Laboratoire de Neurobiologie Humaine UMR 6265 ; Universi...
متن کاملParallel deterministic and stochastic global minimization of functions with very many minima
The optimization of three problems with high dimensionality and many local minima are investigated under five different optimization algorithms: DIRECT, simulated annealing, Spall’s SPSA algorithm, the KNITRO package, and QNSTOP, a new algorithm developed at Indiana University.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Rendiconti Lincei - Matematica e Applicazioni
سال: 2010
ISSN: 1120-6330
DOI: 10.4171/rlm/560